An optimization problem concerning multiplicative functions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Alternating Sums Concerning Multiplicative Arithmetic Functions

We deduce asymptotic formulas for the alternating sums ∑ n≤x(−1)f(n) and ∑ n≤x(−1) 1 f(n) , where f is one of the following classical multiplicative arithmetic functions: Euler’s totient function, the Dedekind function, the sum-of-divisors function, the divisor function, the gcd-sum function. We also consider analogs of these functions, which are associated to unitary and exponential divisors, ...

متن کامل

On a Problem Concerning the Weight Functions

Let X be a finite set with n elements. A function f : X −→ R such that ∑ x∈X f (x) ≥ 0 is called a n-weight function. In 1988 Manickam and Singhi conjectured that, if d is a positive integer and f is a n-weight function with n ≥ 4d there exist at least (n−1 d−1 ) subsets Y of X with |Y | = d for which ∑ y∈Y f (y) ≥ 0. In this paper we study this conjecture and we show that it is true if f is a ...

متن کامل

Arithmetical Functions I: Multiplicative Functions

Truth be told, this definition is a bit embarrassing. It would mean that taking any function from calculus whose domain contains [1,+∞) and restricting it to positive integer values, we get an arithmetical function. For instance, e −3x cos2 x+(17 log(x+1)) is an arithmetical function according to this definition, although it is, at best, dubious whether this function holds any significance in n...

متن کامل

An Objective Penalty Functions Algorithm for Multiobjective Optimization Problem

By using the penalty function method with objective parameters, the paper presents an interactive algorithm to solve the inequality constrained multi-objective programming (MP). The MP is transformed into a single objective optimal problem (SOOP) with inequality constrains; and it is proved that, under some conditions, an optimal solution to SOOP is a Pareto efficient solution to MP. Then, an i...

متن کامل

An Inequality concerning the Rademacher Functions

Let rj , j = 0, 1, . . . be the Rademacher functions on [0, 1]. We prove that for every measurable subset E of [0, 1] with |E| > 0 and for each λ > 1 there exists a positive integer N such that for all real-valued sequences {aj} there exists a subset J of [0, 1] such that ∑∞ j=N |aj | ≤ λ |J| ∫ J∩E ∣∣∣∑∞j=0 ajrj(t)∣∣∣2 dt.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2015

ISSN: 0024-3795

DOI: 10.1016/j.laa.2015.07.005